Sliding window temporal graph coloring

Graph coloring is one of the most famous computational problems with applications in a wide range areas such as planning and scheduling, resource allocation, pattern matching. So far are mostly studied on static graphs, which often stand contrast to practice where data inherently dynamic. A temporal graph has an edge set that changes over time. We present natural extension classical problem. Given integers k ?, we ask for sequence at colors each vertex every time window ? consecutive steps, present, this properly colored least once. thoroughly investigate complexity More specifically, prove strong hardness results, complemented by efficient exact approximation algorithms.